Strengthening Lagrangian Bounds for theMAX - SAT Problem

We propose an algorithm for the strengthening of the Generalized Set Covering formulation of the MAX-SAT Problem. Unlike the standard approach, our procedure does not rely on the solution of the linear relaxation to generate the cuts used to strengthen the formulation. On the contrary, it computes a La-grangian bound and uses the Lagrangian multipliers to guide the generation of cutting planes. Some of the cuts generated by the separation procedure have the additional feature that, once added to the original formulation, cause a strict increase of the lower bound.